Simple learning algorithm for the traveling salesman problem
نویسندگان
چکیده
منابع مشابه
A Simple Learning Algorithm for the Traveling Salesman Problem
We propose a learning algorithm for solving the traveling salesman problem based on a simple strategy of trial and adaptation: i) A tour is selected by choosing cities probabilistically according to the “synaptic” strengths between cities. ii) The “synaptic” strengths of the links that form the tour are then enhanced (reduced) if the tour length is shorter (longer) than the average result of th...
متن کاملan effective ant colony algorithm for the traveling salesman problem
the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...
متن کاملA Guided Learning Algorithm for solving the Traveling Salesman Problem
We propose a novel algorithm for solving the Traveling Salesman Problem (TSP). Our approach uses Genetic Algorithm as a guiding tool to direct Monte Carlo search towards convergence. This hybrid approach leverages a Genetic Algorithm to generate individuals with highly fit genes and uses that information as a base plan for Monte Carlo search. Our experiments suggest that this twostep Expectatio...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1997
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.55.7809